Limit relation for quantum entropy and channel capacity per unit cost

A limit relation for entropy and channel capacity per unit cost

In a quantum mechanical model, Diósi, Feldmann and Kosloff arrived at a conjecture stating that the limit of the entropy of certain mixtures is the relative entropy as system size goes to infinity. The conjecture is proven in this paper for density matrices. The first proof is analytic and uses the quantum law of large numbers. The second one clarifies the relation to channel capacity per unit ...

On channel capacity per unit cost

Absfracf -Memoryless communicat ion channels with arbitrary alphabets where each input symbol is assigned a cost are considered. The max imum number of bits that can he transmitted reliably through the channel per unit cost is studied. It is shown that if the input alphabet contains a zero-cost symbol, then the capacity per unit cost admits a simple expression as the max imum normalized diverge...

Variations On Channel Capacity per Unit Cost

Quantum Channel Capacities Per Unit Cost

Communication over a noisy channel is often conducted in a setting in which different input symbols to the channel incur a certain cost. For example, for the additive white Gaussian noise channel, the cost associated with a real number input symbol is the square of its magnitude. In such a setting, it is often useful to know the maximum amount of information that can be reliably transmitted per...

On Capacity and Capacity per Unit Cost of Gaussian Multiple Access Channel with Peak Power Constraints

This paper investigates the capacity and capacity per unit cost of Gaussian multiple-access channel (GMAC) with peak power constraints. We first devise an approach based on Blahut-Arimoto Algorithm to numerically optimize the sum rate and quantify the corresponding input distributions. The results reveal that in the case with identical peak power constraints, the user with higher SNR is to have...